Asynchronous Circuits, Communicating Processes, and Muller Automaton
نویسنده
چکیده
A finite-state model of communicating processes is presented alongside with the Muller-Bartky model of asynchronous circuits. The purpose of such presentation is to expose a close similarity of these models, at a level of abstraction much lower than the Muller automaton.
منابع مشابه
A Generalized Event Structure for the Muller Unfolding of a Safe Net
asynchronous circuit, event structure, logics of causality, unfolding In 1959, Muller and Bartky published a celebrated paper on .~ Theory of Asynchronous Circuits". Among many novel techniques in that paper was the use of lattices resembling the domains of configurations of event structures. In the light of this we present a generalization of Muller's construction to safe nets. We find, howeve...
متن کاملFsimac: a fault simulator for asynchronous sequential circuits
At very high frequencies, the major potential of asynchronous circuits is absence of clock skew and, through that, better exploitation of relative timing relations. This paper presents Fsimac, a gate-level fault simulator for stuck-at and gate-delay faults in asynchronous sequential circuits. Fsimac not only evaluates combinational logic and typical asynchronous gates such as Muller C-elements,...
متن کاملLanguages of Infinite Traces and Deterministic Asynchronous Automata
In the theory of deterministic automata for languages of infinite words, a fundamental fact relates the family of infinitary limits of regular languages and the family of ω-languages recognized by deterministic Büchi automata. With the known definitions of asynchronous automata, this observation does not extend to the context of traces. A major difficulty is posed by processes that stall after ...
متن کاملTrace automaton: an approach to generating partial-order traces
The trace automaton appears to be a useful tool in generating partially-ordered test cases for asynchronous systems. We give an EXPSPACE algorithm which constructs the trace automaton from a given set of asynchronous communicating processes. Conclusions: We introduce the notion of trace automaton of a system of asyn-chronously communicating input-output state machines such that the trace automa...
متن کاملA 3-State Asynchronous CA for the Simulation of Delay-Insensitive Circuits
We show the construction of a rotationand reflection-invariant local function for a two-dimensional asynchronous cellular automaton with only 3 states and radius 1 Moore neighborhood in which one can implement arbitrary delay-insensitive circuits.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 61 شماره
صفحات -
تاریخ انتشار 2004